Using Abstraction and Nondeterminism to Plan Reaction Loops

نویسنده

  • David J. Musliner
چکیده

By looping over a set of behaviors, reactive systems use repetition and feedback to deal with errors and environmental uncertainty. Their robust, fault-tolerant performance makes reactive systems desirable for executing plans. However, most planning systems cannot reason about the loops that characterize reactive systems. In this paper, we show how the structured application of abstraction and nondeterminism can map complex planning problems requiring loop plans into a simpler representation amenable to standard planning technologies. In the process, we illustrate key recipes for automatically building predictable reactive systems that are guaranteed to achieve their goals.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hydrogen Abstraction Reaction of Hydroxyl Radical with 1,1-Dibromoethane and 1,2-Dibromoethane Studied by Using Semi-Classical Transition State Theory

The hydrogen abstraction reaction by OH radical from CH2BrCH2Br (R1) and CH₃CHBr2 (R2) is investigated theoretically by semi-classical transition state theory. The stationary points for both reactions are located by using ωB97X-D and KMLYP density functional methods along with cc-pVTZ basis. Single-point energy calculations are performed at the QCISD(T) and CCSD(T) levels of theory with differe...

متن کامل

Ab Initio Theoretical Studies on the Kinetics of the Hydrogen Abstraction Reaction of Hydroxyl Radical with CH3CH2OCF2CHF2 (HFE-374pc2)

The hydrogen abstraction reaction of OH radical with CH3CH2OCF2CHF2 (HFE-374pc2) is investigated theoretically by semi-classical transition state theory. The stationary points on the potential energy surface of the reaction are located by using KMLYP density functional method along with 6-311++G(d,p) basis set. Vibrational anharmonicity coefficients, ...

متن کامل

Plan aggregation for strong cyclic planning in nondeterministic domains

Plan aggregation for strong cyclic planning in nondeterministic domains Report Title We describe a planning algorithm, NDP2, that finds strong-cyclic solutions to nondeterministic planning problems by using a classical planner to solve a sequence of classical planning problems. NDP2 is provably correct, and fixes several problems with prior work. We also describe two preprocessing algorithms th...

متن کامل

Nondeterministic Operators in Algebraic Frameworks

A major motivating force behind research into abstract data types and algebraic specifications is the realization that software in general and types in particular should be described (“specified”) in an abstract manner. The objective is to give specifications at some level of abstraction: on the one hand leaving open decisions regarding further refinement and on the other allowing for substitut...

متن کامل

Finding Plans with Branches, Loops, and Preconditions

We present a new approach for finding conditional plans with loops and branches for planning in situations with uncertainty in state properties as well as in object quantities. We use a state abstraction technique from static analysis of programs to builds such plans incrementally using generalizations of input example plans generated by classical planners. Preconditions of the resulting plans ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994